When Are Weak Permutation Polynomials Strong?
نویسندگان
چکیده
منابع مشابه
When are correlations strong?
Feraz Azhar and William Bialek Department of Physics, University of California, Santa Barbara, California 93106 2 Department of Neurosurgery, Brigham and Women’s Hospital, Harvard Medical School, Boston, Massachusetts 02115 Joseph Henry Laboratories of Physics, Lewis–Sigler Institute for Integrative Genomics, and Princeton Center for Theoretical Science, Princeton University, Princeton, New Jer...
متن کاملHow Strong Are Weak Patents?
We analyze patent licensing by a patent holder to downstream technology users. We study how the structure and level of royalties depends on the patent’s strength, i.e., the probability it would be upheld in court. We examine the social value of determining patent validity before licensing, in terms of deadweight loss (ex post) and innovation incentives (ex ante). When downstream users do not co...
متن کاملWeak and Global Supervenience Are Strong
Kim argues that weak and global supervenience are too weak to guarantee any sort of dependency. Of the three original forms of supervenience, strong, weak, and global, each commonly wielded across all branches of philosophy, two are thus cast aside as uninteresting or useless. His arguments, however, fail to appreciate the strength of weak and global supervenience. I investigate what weak and g...
متن کاملWeak and Global Supervenience Are Strong
Kim argues that weak and global supervenience are too weak to guarantee any sort of dependency. Of the three original forms of supervenience, strong, weak, and global, each commonly wielded across all branches of philosophy, two are thus cast aside as uninteresting or useless. His arguments, however, fail to appreciate the strength of weak and global supervenience. I investigate what weak and g...
متن کاملWhen are Two Numerical Polynomials Relatively Prime?
Let a and b be two polynomials having numerical coeecients. We consider the question: when are a and b relatively prime? Since the coeecients of a and b are approximant, the question is the same as: when are two polynomials relatively prime, even after small perturbations of the coeecients? In this paper we provide a numeric parameter for determining that two polynomials are prime, even under s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 1995
ISSN: 1071-5797
DOI: 10.1006/ffta.1995.1034